Randomized algorithm - PDFSEARCH.IO - Document Search Engine

Randomized algorithm
Results: 630

#	Item
521	Multi-Fidelity Algorithms for Interactive Mobile Applications M. Satyanarayanan and Dushyanth Narayanan School of Computer Science Carnegie Mellon University The concept of an algorithm has proved robust over half a cent Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-01-03 12:20:00 Theoretical computer science Computer science Mathematical logic Distributed computing Medical algorithm Anytime algorithm Randomized algorithm Computational complexity theory Parallel computing Algorithms Applied mathematics Mathematics
522	The Computational Complexity of Linear Optics Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-02-09 04:40:42 Quantum complexity theory Analysis of algorithms Linear algebra Quantum computer PP Time complexity BQP Bounded-error probabilistic polynomial Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
523	Fault-Tolerant Clustering in Ad Hoc and Sensor Networks Fabian Kuhn Microsoft Research Silicon Valley 1065 La Avenida Mountain View, CA[removed]removed] Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-04-05 09:53:00 Binary trees NP-complete problems Dominating set Randomized rounding Randomized algorithm Rope David Shmoys Tango tree Theoretical computer science Computational complexity theory Mathematics
524	Distrib. Comput[removed]: 303–310 Digital Object Identiﬁer (DOI[removed]s00446[removed]Constant-time distributed dominating set approximation Fabian Kuhn, Roger Wattenhofer Computer Engineering and Networks La Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-11-03 04:38:57 NP-complete problems Dominating set Algorithm Randomized rounding Connected dominating set Mathematics Theoretical computer science Applied mathematics
525	Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract. We propose a Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-06-25 07:00:09 Mathematics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Dominator Rope Applied mathematics Theoretical computer science Graph theory Binary trees
526	Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-13 15:01:47 Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm SL Immerman–Szelepcsényi theorem In-place algorithm Theoretical computer science Applied mathematics Analysis of algorithms
527	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-24 07:43:23 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Topology Unit disk graph Graph coloring Breadth-first search Graph theory Theoretical computer science Mathematics
528	Costly Valuation Computation in Auctions Kate Larson and Tuomas Sandholm * Computer Science Department Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA[removed]USA Add to Reading List Source URL: www.tark.org Language: English - Date: 2011-10-23 10:31:50 Vickrey auction First-price sealed-bid auction Agent-based model Anytime algorithm Reverse auction Auction Randomized algorithm Algorithm Combinatorial auction Auctioneering Auction theory Business
529	Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2008-06-11 09:51:04 Mathematics Selection algorithm Randomized algorithm Normal distribution Time complexity Big O notation Hash function Theoretical computer science Analysis of algorithms Applied mathematics
530	A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-04-07 20:21:28 Search algorithms Cryptographic hash functions Analysis of algorithms Probabilistic complexity theory Randomized algorithm Algorithm PP Hash function Universal hashing Theoretical computer science Applied mathematics Computational complexity theory

UPDATE